An upper bound for the k-domination number of a graphCOCKAYNE, E. J; GAMBLE, B; SHEPHERD, B et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 533-534, issn 0364-9024Article

Extremal configurations and levels in pseudoline arrangementsSHARIR, Micha; SMORODINSKY, Shakhar.Lecture notes in computer science. 2003, pp 127-139, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

(g, f)-Factorizations orthogonal to k subgraphsHAODI FENG.Lecture notes in computer science. 2001, pp 129-139, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Distance-related invariants on polygraphsJUVAN, M; MOHAR, B; ZEROVNIK, J et al.Discrete applied mathematics. 1997, Vol 80, Num 1, pp 57-71, issn 0166-218XArticle

On eccentric vertices in graphsCHARTRAND, G; SCHULTZ, M; WINTERS, S. J et al.Networks (New York, NY). 1996, Vol 28, Num 4, pp 181-186, issn 0028-3045Article

On the complexity of partitioning graphs into connected subgraphsDYER, M. E; FRIEZE, A. M.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 139-153, issn 0166-218XArticle

On the number of vertices of given degree in a random graphPALKA, Z.Journal of graph theory. 1984, Vol 8, Num 1, pp 167-170, issn 0364-9024Article

The chromatic polynomial of a graphLEHMER, D. H.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 463-469, issn 0030-8730Article

The generating function of whitworth runsLIU, C. J.Discrete mathematics. 1984, Vol 51, Num 3, pp 221-228, issn 0012-365XArticle

An O(|V|*|E|) algorithm for finding immediate multiple-vertex dominatorsALSTRUP, S; CLAUSEN, J; JØRGENSEN, K et al.Information processing letters. 1996, Vol 59, Num 1, pp 9-11, issn 0020-0190Article

Niche number fourGEHRLEIN, W. V; FISHBURN, P.Computers & mathematics with applications (1987). 1996, Vol 32, Num 9, pp 51-54, issn 0898-1221Article

On the chromatic number of the product of graphsDUFFUS, D; SANDS, B; WOODROW, R. E et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 487-495, issn 0364-9024Article

On approximation problems related to the independent set and vertex cover problemsBAR-YEHUDA, R; MORAN, S.Discrete applied mathematics. 1984, Vol 9, Num 1, pp 1-10, issn 0166-218XArticle

Linear algorithm for 3-coloring of locally connected graphsKOCHOL, Martin.Lecture notes in computer science. 2003, pp 191-194, issn 0302-9743, isbn 3-540-40205-5, 4 p.Conference Paper

A simple proof of the Erdos-Gallai theorem on graph sequencesCHOUDUM, S. A.Bulletin of the Australian Mathematical Society. 1986, Vol 33, Num 1, pp 67-70, issn 0004-9727Article

On the degrees of vertices in locally finite graphs which possess a certain edge deletion propertyANDREAE, T.Archiv der Mathematik. 1985, Vol 45, Num 6, pp 574-576, issn 0003-889XArticle

Edge crossings in layered drawings of graphsEADES, P.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 47-50, issn 0044-2267, SUP3Conference Paper

On the sum of two parameters concerning independence and irredundance in a graphCHENGDE WANG.Discrete mathematics. 1988, Vol 69, Num 2, pp 199-202, issn 0012-365XArticle

A decision procedure on partially commutative free monoidsDE LUCA, A; MASSAROTTI, A.Discrete applied mathematics. 1986, Vol 14, Num 1, pp 105-108, issn 0166-218XArticle

Maximum matchings in a class of random graphsFRIEZE, A. M.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 2, pp 196-212, issn 0095-8956Article

Arbres avec un nombre maximum de sommets pendantsPAYAN, C; TCHUENTE, M; XUONG, N. H et al.Discrete mathematics. 1984, Vol 49, Num 3, pp 267-273, issn 0012-365XArticle

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygonsTOUSSAINT, G. T.Computing (Wien. Print). 1984, Vol 32, Num 4, pp 357-364, issn 0010-485XArticle

Standard graphs in lens spacesWU, Ying-Qing.Pacific journal of mathematics. 2005, Vol 220, Num 2, pp 389-397, issn 0030-8730, 9 p.Article

An algorithm for cyclic edge connectivity of cubic graphs: (Extended abstract)DVORAK, Zdenek; KARA, Jan; KRAL, Daniel et al.Lecture notes in computer science. 2004, pp 236-247, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

On the number of edges in graphs with a given weakly connected domination numberSANCHIS, Laura A.Discrete mathematics. 2002, Vol 257, Num 1, pp 111-124, issn 0012-365X, 14 p.Article